An Application of Term Rewriting to the Region of Primitive Recursive Functions
نویسنده
چکیده
In this paper we present a novel termination order the predicative lexicographic path order (PLPO for short), a syntactic restriction of the lexicographic path order. As well as lexicographic path orders, several non-trivial primitive recursive equations, e.g., primitive recursion with parameter substitution, unnested multiple recursion, or simple nested recursion, can be oriented with PLPOs. It can be shown that the PLPO however only induces primitive recursive upper bounds on derivation lengths of compatible rewrite systems. This yields an alternative proof of a classical fact that the class of primitive recursive functions is closed under those non-trivial primitive recursive equations.
منابع مشابه
Predicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive Functions
In this paper we present a novel termination order the predicative lexicographic path order (PLPO for short), a syntactic restriction of the lexicographic path order. As well as lexicographic path orders, several non-trivial primitive recursive equations, e.g., primitive recursion with parameter substitution, unnested multiple recursion, or simple nested recursion, can be oriented with PLPOs. I...
متن کاملTerm rewriting theory for the recursive functions
The termination of rewrite systems for parameter recursion, simple nested recursion and unnested multiple recursion is shown by using monotone interpretations both on the ordinals below the first primitive recursively closed ordinal and on the natural numbers. We show that the resulting derivation lengths are primitive recursive. As a corollary we obtain transparent and illuminating proofs of t...
متن کاملDerivation lengths in term rewriting from interpretations in the naturals
Monotone interpretations in the natural numbers provide a useful technique for proving termination of term rewriting systems. Termination proofs of this shape imply upper bounds on derivation lengths expressed in bounds on the interpretations. For a hierarchy of classes of interpretations we describe these upper bounds, among which the doubly exponential upper bound for polynomial interpretatio...
متن کاملConversion to tail recursion in term rewriting
Tail recursive functions are a special kind of recursive functions where the last action in their body is the recursive call. Tail recursion is important for a number of reasons (e.g., they are usually more efficient). In this article, we introduce an automatic transformation of first-order functions into tail recursive form. Functions are defined using a (first-order) term rewrite system. We p...
متن کاملData-Driven Learning of Functions over Algebraic Datatypes from Input/Output-Examples
We describe a technique for inducing recursive functional programs over algebraic datatypes from few non-recursive and only positive ground example-equations. Induction is data-driven and based on structural regularities between example terms. In our approach, functional programs are represented as constructor term rewriting systems containing recursive rewrite rules. In addition to the example...
متن کامل